A new Karzanov-type O(n3) max-flow algorithm

A NEW KARZANOV-TYPE o(n3) MAX-FLOW ALGORITHM

A new algorithm is presented for finding maximal and maximum value flows in directed single commodity networks. The algorithm gradually converts a combination of blocking preflows and backflows to a maximal flow in the network. Unlike other maximal flow algorithms, the algorithm treats the network more symmetrically by attempting to increase flow on both the ForwardStep and the BackwardStep. Th...

A New Algorithm for Load Flow Analysis in Autonomous Networks

In this paper, a novel algorithm for the load flow analysis problem in an islanded microgrid is proposed. The problem is modeled without any slack bus by considering the steady state frequency as one of the load flow variables. To model different control modes of DGs, such as droop, PV and PQ, in an islanded microgrid, a new formula for load flow equations is proposed. A hybrid optimization alg...

A New Algorithm for MAX-2-SAT

A New Algorithm for Parameterized MAX-SAT

We show how to check whether at least k clauses of an input formula in CNF can be satisfied in time O∗(1.358k). This improves the bound O∗(1.370k) proved by Chen and Kanj more than 10 years ago. Though the presented algorithm is based on standard splitting techniques its core are new simplification rules that often allow to reduce the size of case analysis. Our improvement is based on a simple ...

Ford-Fulkerson Max Flow Labeling Algorithm

The Ford-Fulkerson max ow labeling algorithm[3, 4] was introduced in the mid-1950's, and became the seminal work that is still applicable. The material presented in this note is taken from their book[5]. We are given a simple network with two speci ed nodes: source (s) and sink (t). Since the network is assumed to be simple, an arc is identi ed by its endpoints: (x; y) is the arc from node x to...